Partitions of finite vector spaces over GF(2) into subspaces of dimensions 2 and s
نویسندگان
چکیده
A vector space partition of a finite vector space V over the field of q elements is a collection of subspaces whose union is all of V and whose pairwise intersections are trivial. While a number of necessary conditions have been proved for certain types of vector space partitions to exist, the problem of the existence of partitions meeting these conditions is still open. In this note, we consider vector space partitions of a finite vector space over the field GF (2) into subspaces of dimension 2 and dimension s 6= 2. While certain cases have been done previously (s = 1, s = 3, and s even), in our main theorem we build upon these general results to give a constructive proof for the existence of vector space partitions over GF (2) into subspaces of dimensions s and 2 of almost all types. In doing so, we introduce techniques that identify subsets of our vector space which can be viewed as the union of subspaces having trivial pairwise intersection in more than one way. These subsets are used to transform a given partition into another partition of a different type. This technique will also be useful in constructing further partitions of finite vector spaces.
منابع مشابه
Counting the Restricted Gaussian Partitions of a Finite Vector Space
A subspace partition Π of a finite vector space V = V (n, q) of dimension n over GF(q) is a collection of subspaces of V such that their union is V , and the intersection of any two subspaces in Π is the zero vector. The multiset TΠ of dimensions of subspaces in Π is called the type of Π, or, a Gaussian partition of V . Previously, we showed that subspace partitions of V and their types are nat...
متن کاملOn partitions of finite vector spaces of low dimension over GF(2)
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained in exactly one subspace of P. If there exists a partition of Vn(q) containing ai subspaces of dimension ni for 1 ≤ i ≤ k, then (ak, ak−1, . . . , a1) must satisfy the Diophantine equation ∑k i=1 ai(q ni − 1) = q− 1. In...
متن کاملMatching Subspaces with Complements in Finite Vector Spaces
Let C (n; q) denote the graph whose vertices are the subspaces of the n dimensional vector space V over GF (q) and whose edges are the pairs fX; Y g where X Y = V. We show that C (n; q) has a perfect matching if and only if q is odd or n is odd. If q and n are even and q > 2 we show there exist matchings which omit only one vertex.
متن کاملOn λ-fold Partitions of Finite Vector Spaces and Duality
Vector space partitions of an n-dimensional vector space V over a finite field are considered in [5], [10], and more recently in the series of papers [3], [8], and [9]. In this paper, we consider the generalization of a vector space partition which we call a λ-fold partition (or simply a λpartition). In particular, for a given positive integer, λ, we define a λ-fold partition of V to be a multi...
متن کاملOn the combinatorics of Galois numbers
Ulrich Faigle asked whether this has an immediate combinatorial interpretation in the following sense: Is it always possible to partition the lattice of subspaces of GF (q) into two intervals of length n− 1 and (qn−1 − 1) intervals of length n− 2, for n ≥ 2? We show that such an interval decomposition of the lattice of subspaces of a finite-dimensional vector space exists if and only if there e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 18 شماره
صفحات -
تاریخ انتشار 2012